DISA: a robust scheduling algorithm for scalable crosspoint-based switch fabrics
نویسندگان
چکیده
منابع مشابه
DISA: a robust scheduling algorithm for scalable crosspoint-based switch fabrics
This paper presents and analyzes a high-performance, robust, and scalable scheduling algorithm for input-queued switches called distributed sequential allocation (DISA). In contrast to pointer-based arbitration schemes, the proposed algorithm is based on a synchronized output reservation process, whereby each input selects a designated output while taking into consideration both local transmiss...
متن کاملImpact of scheduling algorithms on performance of crosspoint-queued switch
The performance analysis of the 32x32 crosspoint queued switch is presented in this paper. Switches with small buffers in crosspoints have been evaluated in the late Eighties, but mostly for uniform traffic. However, due to technological limitations of that time, it was impractical to implement large buffers together with switching fabric. The crosspoint queued switch architecture has been rece...
متن کاملScheduling on a Scalable Multiprocessor-Based Telephone Switch
One of the key obstacles to achieving full processing capacity of a shared memory multiprocessor is memory access contention, the extent to which processes access the same location at the sarne time. Accesses to the sarne variable by two or more concurrently executing processes may result in an inconsistent state of the variable. A common way for preventing memcry access contention is disjointi...
متن کاملPerformance analysis of a robust scheduling algorithm for scalable input-queued switches
In this paper a high-performance, robust and scalable scheduling algorithm for input-queued switches, called distributed sequential allocation (DISA), is presented and analyzed. Contrary to pointer-based arbitration schemes, the algorithm proposed is based on a synchronized channel reservation cycle whereby each input selects a designated output, considering both its local requests as well as g...
متن کاملCombined Input-Crosspoint Buffered Packet Switch with Shared Crosspoint Buffers1
The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N), where N is the number of ports, and to the crosspoint buffer size, which is defined by the distance between the line cards and the buffered crossbar, to achieve 100% throughput under high-speed data flows. A long distance between these two components c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2003
ISSN: 0733-8716
DOI: 10.1109/jsac.2003.810535